/*
  Delete Node at a given position in a linked list 
  Node is defined as 
  struct Node
  {
     int data;
     struct Node *next;
  }
*/
Node* Delete(Node *head, int position)
{
    // Complete this method
    if(position == 0) {
        return head->next;
    } else {
        Node *n = head;
        for(int i = 1; i < position; i++)
            n = n->next;
        n->next = n->next->next;
        return head;
    }
}